We propose an information theoretic framework for the secure two-partyfunction computation (SFC) problem and introduce the notion of SFC capacity. Westudy and extend string oblivious transfer (OT) to sample-wise OT. We proposean efficient, perfectly private OT protocol utilizing the binary erasurechannel or source. We also propose the bootstrap string OT protocol whichprovides disjoint (weakened) privacy while achieving a multiplicative increasein rate, thus trading off security for rate. Finally, leveraging our OTprotocol, we construct a protocol for SFC and establish a general lower boundon SFC capacity of the binary erasure channel and source.
展开▼
